Time- and space-efficient evaluation of the complex exponential function using series expansion

نویسنده

  • Sergey V. Yakhontov
چکیده

An algorithm for the evaluation of the complex exponential function is proposed which is quasi-linear in time and linear in space. This algorithm is based on a modified binary splitting method for the hypergeometric series and a modified Karatsuba method for the fast evaluation of the exponential function. The time complexity of this algorithm is equal to that of the ordinary algorithm for the evaluation of the exponential function based on the series expansion: O(M(n) log(n)2).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time-Discontinuous Finite Element Analysis of Two-Dimensional Elastodynamic Problems using Complex Fourier Shape Functions

This paper reformulates a time-discontinuous finite element method (TD-FEM) based on a new class of shape functions, called complex Fourier hereafter, for solving two-dimensional elastodynamic problems. These shape functions, which are derived from their corresponding radial basis functions, have some advantages such as the satisfaction of exponential and trigonometric function fields in comple...

متن کامل

External and Internal Incompressible Viscous Flows Computation using Taylor Series Expansion and Least Square based Lattice Boltzmann Method

The lattice Boltzmann method (LBM) has recently become an alternative and promising computational fluid dynamics approach for simulating complex fluid flows. Despite its enormous success in many practical applications, the standard LBM is restricted to the lattice uniformity in the physical space. This is the main drawback of the standard LBM for flow problems with complex geometry. Several app...

متن کامل

FP//LINSPACE computability of Riemann zeta function in Ko-Friedman model

In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function ζ(s) for all real s, s > 1, in polynomial time and linear space on Turing machines in Ko–Friedman model. The algorithms is based on a series expansion of real Riemann zeta function ζ(s) (the series globally convergents) and uses algorithms for the evaluation of real function (1 + x) h and hypergeo-m...

متن کامل

A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach

In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...

متن کامل

NUMERICAL APPROACH TO SOLVE SINGULAR INTEGRAL EQUATIONS USING BPFS AND TAYLOR SERIES EXPANSION

In this paper, we give a numerical approach for approximating the solution of second kind Volterra integral equation with Logarithmic kernel using Block Pulse Functions (BPFs) and Taylor series expansion. Also, error analysis shows efficiency and applicability of the presented method. Finally, some numerical examples with exact solution are given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1208.2832  شماره 

صفحات  -

تاریخ انتشار 2012